Adding Enrichments to Reened Interleavings: a New Model for the {calculus

نویسنده

  • Michael Baldamus
چکیده

The question of how to model {calculus name passing has attracted signiicant interest. Here, this topic is approached with a new fully abstract interleaving model. Its central feature: Every semantic object contains all its transformations under injective name replacements. It is shown how this enrichment can be used, in a systematic way, to obtain compositional interpretations of the constructors of the {calculus. The theory of non{well{founded sets serves as the mathematical basis. Moreover, category theory is used in the form of coalgebras of endo{functors. Not more is needed since transformations under name replacements are not regarded as arrows of a category of partial orders of (un{enriched) semantic objects. This approach is a hallmark of previous interleaving models of the {calculus. It seems to require a lot more category theory than is used here. Also, unlike other related work, the present one does not employ type theory.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Monotonic Partial Order Reduction: An Optimal Symbolic Partial Order Reduction Technique

We present a new technique called Monotonic Partial Order Reduction (MPOR) that effectively combines dynamic partial order reduction with symbolic state space exploration for model checking concurrent software. Our technique hinges on a new characterization of partial orders defined by computations of a concurrent program in terms of quasi-monotonic sequences of thread-ids. This characterizatio...

متن کامل

A Method for Solving Super-Efficiency Infeasibility by Adding virtual DMUs with Mean Values

Using super-efficiency, with regard to ranking efficient units, is increasing in DEA. However, this model has some problems such as the infeasibility. Thus, this article studies infeasibility of the input-based super-efficiency model (because of the zero inputs and outputs), and presents a solution by adding two virtual DMUs with mean values (one for inputs and one for outputs). Adding virtual ...

متن کامل

Lazy Parallel Kronecker Algebra-Operations on Heterogeneous Multicores

Kronecker algebra is a matrix calculus which allows the generation of thread interleavings from the source-code of a program. Thread interleavings have been shown effective for proving the absence of deadlocks. Because the number of interleavings grows exponentially in the number of threads, deadlock analysis is still a challenging problem. To make the computation of thread interleavings tracta...

متن کامل

Reconstruction of the neural network model of motor control for virtual C.elegans on the basis of actual organism information

Introduction: C. elegans neural network is a good sample for neural networks studies, because its structural details are completely determined. In this study, the virtual neural network of this worm that was proposed by Suzuki et al. for control of movement was reconstructed by adding newly discovered synapses for each of these network neurons. These synapses are newly discovered in the actu...

متن کامل

NON-POLYNOMIAL SPLINE FOR THE NUMERICAL SOLUTION OF PROBLEMS IN CALCULUS OF VARIATIONS

A Class of new methods based on a septic non-polynomial spline function for the numerical solution of problems in calculus of variations is presented. The local truncation errors and the methods of order 2th, 4th, 6th, 8th, 10th, and 12th, are obtained. The inverse of some band matrixes are obtained which are required in proving the convergence analysis of the presented method. Convergence anal...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999